package com.offer.leetcode;

/**
 * leetcode-剑指offer Solution58
 */
public class Solution12 {

    public String reverseLeftWords(String s, int n) {

        if (s == null || n <= 0) {
            return s;
        }

        String pre = s.substring(0, n);
        String suffix = s.substring(n);
        return suffix + pre;
    }

    public static void main(String[] args) {
        // Solution58 s = new Solution58();
        // System.out.println(s.reverseLeftWords("lrloseumgh", 6));

        int max = 0;

        for (int i=0; i< 1; ++i) {
            max = max * 10 + 9;
        }

        System.out.println(max);
    }

}